Automated Checking of Observational Equivalence for an Extended Spi Calculus
نویسندگان
چکیده
Borgström et al. proposed a notion of symbolic bisimilarity for the Extended Spi Calculus [12]. They developed a prototype tool, called SBC (Symbolic Bisimulation Checker) [10] implementing observational equivalence checking for arbitrary processes using shared-key cryptography. However, it is based on hard-coded equational theories. We have partially extended SBC towards checking processes using a large class of equational theories for the message algebra. With our extension, the user can freely specify such an equational theory.
منابع مشابه
A Trace Based Bisimulation for the Spi Calculus: An Extended Abstract
A notion of open bisimulation is formulated for the spi calculus, an extension of the π-calculus with cryptographic primitives. In this formulation, open bisimulation is indexed by pairs of symbolic traces, which represent the history of interactions between the environment with the pairs of processes being checked for bisimilarity. The use of symbolic traces allows for a symbolic treatment of ...
متن کاملObservational equivalence and trace equivalence in an extension of Spi − calculus . Application to cryptographic protocols analysis Research Report LSV − 02 − 3 , Mar . 2002 Ecole Normale
متن کامل
EquivalEncEs and calculi for formal vErification of cryptographic protocols
Security protocols are essential to the proper functioning of any distributed system running over an insecure network but often have flaws that can be exploited even without breaking the cryptography. Formal cryptography, the assumption that the cryptographic primitives are flawless, facilitates the construction of formal models and verification tools. Such models are often based on process cal...
متن کاملExtended pi-Calculi
We demonstrate a general framework for extending the picalculus with data terms. In this we generalise and improve on several related efforts such as the spi calculus and the applied pi-calculus, also including pattern matching and polyadic channels. Our framework uses a single untyped notion of agent, name and scope, an operational semantics without structural equivalence and a simple definiti...
متن کاملSymbolic Bisimulation in the Spi Calculus
The spi calculus is an executable model for the description and analysis of cryptographic protocols. Security objectives like secrecy and authenticity can be formulated as equations between spi calculus terms, where equality is interpreted as a contextual equivalence. One problem with verifying contextual equivalences for message-passing process calculi is the infinite branching on process inpu...
متن کامل